Lengths of Irreducible and Delicate Words
نویسندگان
چکیده
We study words that barely avoid repetitions, for several senses of "barely". A squarefree (respectively, overlap-free, cubefree) word is irreducible if removing any one its interior letters creates a square overlap, cube). delicate changing classify the lengths and squarefree, cubefree over binary ternary alphabets.
منابع مشابه
Irreducible Factorization Lengths and the Elasticity Problem within ℕ
A large class of multiplicative submonoids of the natural numbers is presented, which includes congruence monoids as well as numerical monoids (by isomorphism). For monoids in this class, the important factorization property of finite elasticity is characterized.
متن کاملIrreducible Factorization Lengths and the Elasticity Problem within N
A large class of multiplicative submonoids of the natural numbers is presented, which includes congruence monoids as well as numerical monoids (by isomorphism). For monoids in this class, the important factorization property of finite elasticity is characterized.
متن کاملthe effect of translation versus matching words and definitions on retrieval of vocabulary among iranian intermediate efl learners
این تحقیق جهت بررسی تأثیر ترجمه در برابر ایجاد ارتباط بین لغات و ارائه معانی بر بازیابی واژگان در میان زبان آموزان متوسط ایرانی انجام شده است. به این منظور سه گروه کامل از دانش آموزان سطح متوسط که کتاب اینترچنج3 را مطالعه می کردند پس از انجام تست استاندارد مهارت سنجی انتخاب شدند. در ابتدا محقق آنها را به دو گروه آزمایشی و یک گروه کنترل یا شاهد تقسیم نمود و درمرحله بعد از کلیه دانش آموزان در سه ...
lexical decomposition awareness and its effect on delayed receptive and productive recognition and recall of vocabulary knowledge of morphologically complex english words: an iranian efl context
abstract lexical knowledge of complex english words is an important part of language skills and crucial for fluent language use (nation, 2001). the present study, thus, was an attempt to assess the role of morphological decomposition awareness as a vocabulary learning strategy on learners’ productive and receptive recall and recognition of complex english words. so 90 sophomores (female and ma...
15 صفحه اولOn lengths of words in context-free languages
We consider slender languages, that is, languages for which the number of words of the same length is bounded from above by a constant. We prove that the slenderness problem is decidable for context-free languages and that the maximal number of words of the same length in a given context-free language is computable. Some e ective representations of slender context-free languages, as well as oth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2022
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/10669